Simplex Method Of Linear Programming Research Articles

Materials inventory optimization using various forecasting techniques and purchasing quantity in packaging industry

Purpose: This paper studies the problem that occurs on material purchase quantity in price uncertainty situation. Larger buying quantity when the price at high will increase the purchase amount while smaller buying quantity could risk the inventory level. The decision on the purchase quantity of a cycle takes future price as input from price prediction output.Design/methodology/approach: This paper examines five price prediction models, Classification and Regression Tree (CART), Random Forest Regressor (RFR), Support Vector Regressor (SVR), Seasonal Autoregressive Integrated Moving Average (SARIMA) and Long Short Term Memory (LSTM) to predict four Petrochemical products, Linear Low Density Polyethylene (LLDPE), Low Density Polyethylene (LDPE), Biaxially Oriented Polypropylene (BOPP) and Cast Polypropylene (CPP) using dataset built from weekly datapoints from January 2020 to June 2023. The most performing model is validated with data from July 2023 to September 2023 where the prediction result is fed into Linear Programming Simplex method to minimize the amount of purchase by making advanced or postpone orders.Findings: Result that RFR performs higher at most products tested, while SVR performs higher in LDPE product. The fitting of RFR and SVR models prediction, as predicted price to Linear Programming that decides optimum purchase quantity, delivers a total 2.2% of purchase amount reduction compared to original purchase quantity reflecting base scenario issued by the planner.Research limitations/implications: This study does not include additional prediction factors such as freight cost and the hyperparameters tuning studies on the existing factors.Originality/value: The novelty of this paper is prediction value is followed up by an optimization model that would guide the Procurement team decisions for future anticipation because imported raw materials should be purchased ahead of time. This research will provide a scientific approach input that would counterbalance or strengthen decision making that is typically made by individuals owning years of experience. This combined approach is rarely researched and has not been done to polymer products.

A simplex approach for binary linear programming

This article is a research, design, and development effort, on an algorithm for Binary Linear Programming (BLP). The idea of the algorithm is based on the concepts borrowed from the Simplex method of Linear Programming (LP). The Simplex method has both column selection and row selection logics for generating a pivot. In this article we select both logics of LP to use as only the column selection logic for the BLP. The article provides the complete implementable C-language source code of this version of the BLP algorithm to show all the details of the logics. In addition, it provides a simple software requirement for embedded engineering products based on the laws of nature. It helps to design, modify, and maintain a simpler code for the algorithms. Therefore, the article uses a multidisciplinary approach. It integrates optimization theory, matrix algebra, computer programming, software engineering design requirements, social science, laws of nature, etc. This BLP algorithm will shed some light on the P-NP problem and its solution.

Students’ procedural knowledge on simplex method in linear programming: An explanatory sequential design

This study employed a sequential explanatory mixed-methods design to assess students' procedural knowledge in linear programming using the simplex method through quantitative tests, qualitative interviews, and Focus Group Discussions (FGD). The objective was to uncover students' understanding of the step-by-step procedure in the simplex method, with results indicating a low level of knowledge (38.31%) in solving linear programming problems. Thematic analysis from the qualitative phase identified students' perceptions of the problem-solving process. Based on these findings, it is recommended that educators adopt more in-depth and multifaceted teaching strategies to enhance students' procedural understanding. This research has implications for developing teaching strategies to improve students' procedural knowledge in linear programming.

Optimasi Kapasitasi Produksi Untuk Memperoleh Keuntungan Maksimum dengan Linear Programming Metode Simpleks

This research is a progress report of the project entitled "Optimization of Production Capacitation to Obtain Maximum Profit with Linear Programming Simplex Method (Study on Alltho Beverage UMKM)". This project aims to help the owner of Alltho Micro, Small, and Medium Enterprises (MSMEs) in optimizing the production and profit of their products. In this study, the linear programming method with the simplex method technique was used to find the optimal solution that maximizes the profits of Alltho UMKM. Data on the maximum capacity of raw materials and product selling prices are determining factors in the calculation. The three main products analyzed were Red Velvet Choco Royal, Choco Royal Oreo, and Greentea Choco Royal. The results showed that using the linear programming simplex method, the optimal production quantities of each product were 10.29 Red Velvet Choco Royal drinks and 11.76 Greentea Choco Royal drinks, while the production of Choco Royal Oreo should be temporarily stopped. These results indicate that Alltho MSMEs can achieve maximum profits of around IDR 227,942 by producing these products according to the recommended quantities. This research provides an important contribution to decision-making in MSME production management, helps improve efficiency in resource utilization, and provides an overview of the importance of applying mathematical techniques in optimizing MSME businesses in a competitive era.

Implementasi linear programming metode simpleks dalam mencari keuntungan maksimum pada UMKM Es Dingin

In a Micro, Small and Medium Enterprises (MSMEs), business actors often do not know exactly how many goods must be produced and sold in order to get maximum profit. To find out the maximum profit and the number of products that must be produced, the simplex method in linear programming can be used. The simplex method is a method to find the optimal solution of a linear programming model with the principle of iteration. There is a tool to solve linear programs quickly, namely Lingo software that can be used to calculate many problems in a fast time. To implement this simplex method, the data taken by researchers is on MSMEs that produce Cold Drinks with the name Cold Ice. That way, the purpose of this study is to find out how much maximum profit is obtained after obtaining the optimum production amount of each product on Cold Ice in the Medan area.

EVALUATING THE EFFICIENCY OF THE PROCESS OF CHANGING THE CONFIGURATION OF THE ENTERPRISE

It should be noted that in modern operating conditions, organizations increasingly have to face the complexity and dynamism of the external environment. However, other external changes (simplification and stability of the environment) also often take place (especially for mature enterprises), which are identified in the case of analyzing the impact of external environmental factors, as a rule, using the method of expert assessments. The article proposes to apply the classification of structures developed by H. Mintzberg, which is based on the principle of determining the type of configuration, considering the existing horizontal and vertical decentralization, the influence of the key part of the structure and the dominant coordination mechanism, and rooted on the principle of correspondence of a certain type of configuration to a certain type of external, to carry out a timely change of the structural form from the existing to the planned one, which will comfortably exist in the current external conditions. The author presents the field of configurations consisting of pure and hybrid forms (in the case of combining design parameters of different configurations). The article also proposes to use the developed system of minimally necessary and sufficient indicators of the effectiveness of the transformation process, which correspond to the fact of qualitative transformation directly for the existing direction in case of a change in the level of influence of environmental factors. As a system of indicators, it is proposed to use: general economic efficiency, value gap, the fact of creating an innovation as a qualitative indicator of the transformation process, flexibility and rationality of the structure, its controllability norm. The article presents the sequence of evaluating the effectiveness of the transformation of the organizational structure, when using the basics of the simplex method of linear programming.
 The given sequence of evaluating the effectiveness of transformation of the organizational structure of the enterprise can be applied in the case of enterprises functioning in different types of external environment, in different types of technological structure of enterprises, sizes of organizations, age of existence on the market of goods or services. It is recommended for use by enterprises of production, construction, automobile and transport complexes, residential and communal and commercial enterprises, non-profit organizations, etc.

Profit Optimization and Production of Maesa Cake and Bakery Shops with Linear Programming-Simplex Method

Profit Optimization and Production of Maesa Cake and Bakery Shops with Linear Programming-Simplex Method

Profit Optimization and Production of Maesa Cake and Bakery Shops with Linear Programming-Simplex Method

The need for cake as a complementary food at various events causes the demand to increase. This increase has an impact on the production level that will be produced with the aim of increasing profits. The production process is related to the allocation of the right raw materials to be efficient, so that maximum profits will be obtained. This study aims to analyze the maximum profit of the Maesa Cake and Bakery Shop, Permata Legenda Branch. There are two types of products sold in this shop, namely Banana Bolu (X1) and Banana Bolen (X2). The research method used is linear programming which is solved by the simplex method and the use of the POM For Windows application. The data obtained is observational data by meeting the shop owner directly to be interviewed. The process of calculating the simplex method is carried out using Ms. Excel with several completion steps, starting from creating a simplex table, entering the coefficients of the objective function and constraints, looking for key columns, key rows, and key numbers, until the last step is achieving positive coefficients generated in the objective function row. The final result obtained is the process of the iterations carried out. Apart from using Ms. Excel, researchers also use the POM for Windows application. Use both software to find the maximum profit to be achieved. So it is found that the maximum profit that can be obtained in one day by the Maesa Cake and Bakery Branch of Permata Legenda is IDR 270,000.00; by producing 5 units of Banana Bolu and 50 units of Banana Bolen.

Weighted distances in the Cairo pattern

The Cairo Pattern is an interesting tiling of the plane. It consists of pentagons which completely cover the plane without overlapping. The Cairo Pattern is the dual of a semi-regular grid. It is assumed that one can walk on the pentagons such that it is possible to step only two neighboring pentagons. Different types of steps have different weights. The distance of two pentagons is the length of the minimal path between them. All distances are based on a linear programming model. The main tool of the analysis is the simplex method of linear programming. The analysis also uses the special properties of the model of minimal path. All minimal paths are given explicitly. Therefore, the complexity of our final result is O(1) inspite of the fact that the general simplex method is thought to be exponential.

Sistim Pendukung Keputusan Menentukan Volume Produksi Keripik Tempe Menggunakan Metode Simplek

Tempe can be processed to be used as a variety of dishes and snacks. Tempe chips are processed tempeh made from the main raw material of tempe which is thinly sliced ​​then seasoned and then fried until it has a crunchy texture. Tempe chips have become a business opportunity for Rimbo Ilir, Tebo Regency, Jambi Province with four flavors, Balado, cheese, BBQ and original flavors. The purpose of this study is to help the manager determine the production volume of tempeh chips according to the flavor variant in order to get the expected profit and minimize losses. The method used in this study is linear programming simplex method, using this method the manager is advised to produce tempe chips with Balado flavor of 18,225 pcs and cheese flavored with 6,795 pcs, with a profit of Rp. 24,493. From the sensitivity analysis, it does not mean that BBQ and cheese flavors should not be produced, but that they have a maximum production limit, for BBQ flavors a maximum of 6,286 pcs and original flavors 5,744 pcs.

Optimalisasi Keuntungan Atas Produk-Produk Pada Usaha Sanggar Ukir Kayu di Tenggarong (Penerapan Linear Programming Dengan Metode Simpleks)

Abstract :The main objective of this research is to find out if any kind of timber production in Wood Carving Studio has reached the maximum profit. A series of observations carried out on the object of research, namely Wood Carving Studio Effort in Tenggarong in which Companies will get the maximum benefit from the product combination product i.e. 2 Ventilation (X 2) with the number of optimal production by as much as 100 units and Nameplate (X 3) and the number of optimal production by as much as 75 units. Maximum benefits will achieved Rp 16,525,000,-. For the cost of ulin wood or slack 1 (S1) and the cost of paint or slack 3 (S3) each still costs as much as Rp meyisakan,-2.5 million and Rp 75,000,-this indicates that companies can save costs on slack slack 1 and 3 respectively as much as Rp 2.5 million, -and Idr 75,000,-or can aggregate to Rp 2,575,000,-for 3 months. Unlike for products that have the status of non basic or value of 0 (zero) this means that other products better not manufactured by the company because it does not generate the maximum profits. Then the hypothesis has been put forward previously stating "that the production of Wood Carving Studio Effort in Tenggarong has been at the optimum point thus generating maximum profits" is rejected and not proven to be true. Keyword: Optimisation Of The Profits (The Application Of The Linear Programming Simplex Method) 

Analisis Kontribusi Keuntungan Atas Produk- Produk Pada CV. Salim Tailor Di Tenggarong (Penerapan Linear Programming Metode Simplek)

The main objective of this study was to find out whether the production amount of CV. Salim Tailor In Tenggarong has been at the optimum point to generate maximum profit contribution and to know which type of products that generate maximum profit contribution from various products produced by CV Salim Tailor in Tenggarong.The research result is indicated that business well get maximal profit from product Pants (X1) with respective optimal production quantities are rounded to 24,4253 unit it’s mean that 24 unit plus 1 unit product on process productions 42,53% and also product PDL (X5) with respective optimal production quantities are rounded to 13,472% unit it’s mean that 13 unit plus 1 unit product on process productions 4,72%  with the maximum profit Rp. 29.188.950 for 1 month.For the time of measurement and cutting or process 1 (S1) still leave time during 5,0833 minute, this is indicated that the company have a lost time on the process 1 for more or less 0,08 hours for 1 month. Keywords: Profit Contributions (Application of Linear Programming Simplex Method)

The Implementation Of Linear Programming Simplex Method To Generate Optimal Profits An-Nisa Koya

This research aims to find out the profit optimization model in AN-NISA Koya company by using linear programming method simplex whether there is a difference between before and after using linear programming simplex method. The main raw materials used by the company are rice and granulated sugar. The study used interview data collection techniques, library studies, and observations. The method used in this study is a qualitative descriptive approach. The method used in this study is the linear programming simplex method which is calculated manually and with the help of POM-QM software. Based on the results of research, it is known that with the linear programming simplex method using the helped of POM-QM software the company can optimize profits. And from comparative analysis, there is a difference between the results of data before using linear programming method simplex and after using linear programming method simplex.

Analisis Optimalisasi Keuntungan dengan Integer Linear Programming (ILP) dan Metode Branch and Bound pada UMKM RM Selera

A business such as MSMEs often experiences many obstacles or problems that hinder it in achieving its business goals. One of these problems is how to get the maximum profit by optimizing the product to be produced. Basically, the main purpose of building a business is to get enough profit or profit as much as possible. Optimization problems are part of society's problems, especially those engaged in the production business. Optimization is to minimize production costs and maximize sales revenue. This study aims to determine the most optimal number of products and maximize profits in optimizing Ayam Goreng production at RM Selera SMEs using the Integer Linear Programming simplex method and continued with the Branhc and Bound method. The results get with the addition of constraints 𝑥1 ≤ 0 obtained results X1 = 0 and X2 = 2 while with constraints 1 1 obtained results X1 = 1 and X2 = 1.5. The optimum integer solution has been obtained, namely the result of LP - 4 with X1 = 0 and X2 = 2. The maximum profit obtained for the Ayam Goreng Sambal Pecel and Ayam Goreng Sambal Rica at RM Selera SMEs is Rp.1.900.000.

Parameter Matching Methods for Li Battery–Supercapacitor Hybrid Energy Storage Systems in Electric Buses

The parameter matching of composite energy storage systems will affect the realization of control strategy. In this study, the effective energy and power utilizations of an energy storage source were defined. With the miniaturization of a composite energy storage system as the optimization goal, the linear programming simplex method was employed to obtain the optimized masses of Li batteries and supercapacitors under the constraints of maximum speed, climbing gradient, acceleration time and cost-effectiveness. As the module numbers shall be integers, the matching results were modified in combination with the graphical method. Owing to the influences of parameter matching schemes on the overall performance and battery life, the critical points of constraints were analyzed and the most appropriate matching numerical points of the composite energy storage system were identified. Simulation and experimental analysis were conducted under practical urban road conditions in China. The results show that the proposed matching method delivers accurate results. Compared with conventional electric buses, the mileage and overall performance of the prototype bus are improved.

Optimization Heavy Equipment Productivity Against Costs on Un-Top Soil and Spreading Work With Linear Programming Simplex Method

PT Bhumi Rantau Energi is a coal mining company in Indonesia located in South Kalimantan, Indonesia. As a mining company, one of the obligations that must be carried out is land reclamation so as not to cause environmental damage. Land reclamation is carried out by planting tree seeds on ex-mining land. The stages of the process for land reclamation are Top Soil excavation. Top soil is the top layer of soil that contains the most nutrients and has the most air content among other soil layers. The excavated top soil will be spread over the ex-mining land that has been provided for reclamation. The purpose of this study is to determine the productivity, number of heavy equipment and also the costs that will be incurred for the Top Soil and Spreading excavation activities. As for determining the minimum cost, it can be analyzed using mathematical programming techniques, one of which is linear programming using the simplex method. This technique is very useful in finding the best solution for a function with more than two variables under the given constraints. Linear programming is a mathematical method that allocates limited resources to achieve a goal such as maximizing profits and minimizing costs. The research method used is a quantitative method. From the results of the study, it was found that for Top Soil and Spreading work for 8 months, 2 Excavator Units with Productivity of 182.25 m³/hour, 2 Bulldozer Units with Productivity of 181.56 m³/hour, 9 Dump Truck Units with Productivity 39.94 m were needed. /hour and 1 Motor Grader Unit with Productivity of 16,128 m²/hour, then the cost incurred for the work is Rp. 18,017,984,600.

On Some Aspects of the Examination in Econometrics

Teaching econometrics has been studied by a number of researchers, however, there is little information available on the quality of examination and on simplification of tests for demonstration the high-quality knowledge by students in concrete topics of econometrics or mathematical economics.One can note the following main goals of studying the basics of mathematical economics or econometrics by students: forming the notions of mathematical model and of modeling economic processes and phenomena; understanding a role of using mathematical models for economics research and obtaining scientific results; formatting skills for constructing mathematical models in economics, for solving economics problems by mathematical modeling.The main goal of this paper is to simplify test tasks, is to help to students to demonstrate the high-quality knowledge in certain areas of mathematical economics, and also is to construct a system of testing tasks, in which the emphasis was placed on the knowledge and understanding of an algorithm of solving the problem.In the present paper, to quality examine the student knowledge in the basics of mathematical economics, a certain system of tests was constructed and is considered. The main attention is also given to algorithms and techniques of solving some tasks (problems) of mathematical economics. The following topics of mathematical economics are viewed: constructing mathematical models of linear programming, the input-output model, the Monge-Kantorovich transportation problem, the simplex method of linear programming, the graphic method of linear and nonlinear programming, the method of Lagrange multipliers in mathematical optimization. Some primary basic results of studying linear programming, nonlinear programming, and the input-output model are noted.A new system of tests that satisfies the aim of this paper is modeled. The described tests require less time for solving than usual tasks. Here we do not focus on the repetition of auxiliary mathematical knowledge and arithmetic skills. These tests are simplified versions of standard tasks and help students to demonstrate knowledge in the mentioned topics of mathematical economics. The tasks are focused only on the knowledge of basic formulas, techniques, and connections between mathematical objects, economic systems, and their elements.

Jurnal Transformatif ANALISIS PENENTUAN LUAS PRODUKSI PADA PERUSAHAAN ROTI BANGKIT JAYA DI KOTA KUPANG

The purpose of this study is to analyze the determination of production volumeto maximize profits. This research is a quantitative research. Data analysis techniques are Forecasting and Linear Programming (Simplex Method). The result of analysis concluded thatthe production volume using Linear Programming simplex method obtained in 2019 should produce as many as 405,792,000 molten chocolate bread per year and by 2020 should produce as many as 4,107,480 molten chocolate bread per year for earning maximum profit. Meanwhile, the Forecasting result is to produce 4 types of bread as many as 6,308,240 breads in 2019 and 6,365,560 breads in 2020. In terms of profit optimization then calculation using Linear Programming is better however considering the marketing aspect where consumers require a variety of bread flavors then calculation using forecasting method is more recommended.

Error correction technique for numerical control machine tools based on the simplex method

The objective of this research is to develop a novel correction mechanism to reduce the fluctuation range of tools in numerical control (NC) machining. Error compensation is an effective method to improve the machining accuracy of a machine tool. If the difference between two adjacent compensation data is too large, the fluctuation range of the tool will increase, which will seriously affect the surface quality of the machined parts in mechanical machining. The methodology used in compensation data processing is a simplex method of linear programming. This method reduces the fluctuation range of the tool and optimizes the tool path. The important aspect of software error compensation is to modify the initial compensation data by using an iterative method, and then the corrected tool path data are converted into actual compensated NC codes by using a postprocessor, which is implemented on the compensation module to ensure a smooth running path of the tool. The generated, calibrated, and amended NC codes were immediately fed to the machine tool controller. This technique was verified by using repeated measurements. The results of the experiments demonstrate efficient compensation and significant improvement in the machining accuracy of the NC machine tool.

Determination of Natural Risk Sources Effective in Wheat Production in Hadim District with the Help of Linear Programming

There are many sources of natural risks affecting wheat cultivation. In this study, it is aimed to estimate the minimum and maximum risk ranges and premium and compensation amounts of the natural risk factors affecting the wheat yield in Hadim district of Konya in terms of farmers and insurance. As natural risk factors, disease and pests, frost, drought, hail, fire and the interactions of other risks and factors were examined. The number of factors dealt with in the study is 6, and the total number of linear models created using all combinations is 63. The 63 linear models established, the minimum and maximum risk ranges in terms of farmers and insurance were determined by using the simplex method of linear programming on the basis of yield and price. In addition, diseases and pests and other risk factors not included in the scope of agricultural insurances were included in the linear models and wheat yield was estimated on district basis. In the model with all risk factors, the expected risk value of the farmer is 64.962 (kg / ha-1) -71.588 (TL / ha-1), while it is estimated as 53.548 (kg / ha-1) -59.009 (TL / ha-1) in terms of insurance. has been. As a result, it was estimated that the farmer paid 20,831 (TL / ha-1) premiums and 122,344 (TL / ha-1), while insurance companies paid 59,009 (TL / ha-1) premium 84,018 (TL / ha-1) compensation.